Streamlined Constraint Reasoning
نویسندگان
چکیده
We introduce a new approach for focusing constraint reasoning using so-called streamlining constraints. Such constraints partition the solution space to drive the search first towards a small and structured combinatorial subspace. The streamlining constraints capture regularities observed in a subset of the solutions to smaller problem instances. We demonstrate the effectiveness of our approach by solving a number of hard combinatorial design problems. Our experiments show that streamlining scales significantly beyond previous approaches.
منابع مشابه
Automatically Generating Streamlined Constraint Models with Essence and Conjure
Streamlined constraint reasoning is the addition of uninferred constraints to a constraint model to reduce the search space, while retaining at least one solution. Previously, effective streamlined models have been constructed by hand, requiring an expert to examine closely solutions to small instances of a problem class and identify regularities. We present a system that automatically generate...
متن کاملFrom Streamlined Combinatorial Search to Constructive Procedures
In recent years, significant progress in the area of search, constraint satisfaction, and automated reasoning has been driven in part by the study of challenge problems from combinatorics and finite algebra. This work has led to the discovery of interesting discrete structures with intricate mathematical properties. While some of those results have resolved open questions and conjectures, a sho...
متن کاملمقایسه اثر بخشی ماسک حنجره ای کلاسیک (LMA ) با streamlined liner pharyngeal airway (SLIPA ) در بیهوشی عمومی
متن کامل
Spatio-temporal Reasoning Using a Multi-dimensional Tesseral Representation
A versatile and universally applicable quantitative multi-dimensional reasoning mechanism founded on a unique linear tesseral representation of space is described. The reasoning mechanism is based on a constraint satisfaction mechanism supported by a heuris-tically guided constraint selection strategy. The mechanism has been incorporated into a spatio-temporal reasoning system, the SPARTA (SPAt...
متن کاملConstraint Programming for Modelling and Solving Modal Satisfiability
We explore to what extent and how efficiently constraint programming can be used in the context of automated reasoning for modal logics. We encode modal satisfiability problems as constraint satisfaction problems with non-boolean domains, together with suitable constraints. Experiments show that the approach is very promising.
متن کامل